The bounded functional interpretation of the double negation shift
نویسندگان
چکیده
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we show that full numerical comprehension is compatible with the uniformities introduced by the characteristic principles of the bounded functional interpretation for the
منابع مشابه
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
This note reexamines Spector’s remarkable computational interpretation of full classical analysis. Spector’s interpretation makes use of a rather abstruse recursion schema, so-called bar recursion, used to interpret the double negation shift DNS. In this note bar recursion is presented as a generalisation of a simpler primitive recursive functional needed for the interpretation of a finite (int...
متن کاملThe Herbrand Functional Interpretation of the Double Negation Shift
This paper considers a generalisation of selection functions over an arbitrary strong monad T , as functionals of type J RX = (X → R) → TX. It is assumed throughout that R is a T -algebra. We show that J R is also a strong monad, and that it embeds into the continuation monad KRX = (X → R) → R. We use this to derive that the explicitly controlled product of T -selection functions is definable f...
متن کاملAn interpretation of the Sigma-2 fragment of classical Analysis in System T
We consider the Double-negation Shift (DNS) as a constructive principle in its own right and its effect on modified realizability (MR) and Dialectica (D) interpretations. We notice that DNS proves its own MR-interpretation, meaning that a priori one does not have to consider the more complex D-interpretation with Bar Recursion for interpreting Analysis. From the “with truth” variant of MR, we o...
متن کاملOn the Computational Content of the Axiom of Choice
We present a possible computational content of the negative translation of classical analysis with the Axiom of Choice Our interpretation seems computationally more direct than the one based on G odel s Dialectica interpretation Interestingly this interpretation uses a re nement of the realizibility semantics of the absurdity proposition which is not interpreted as the empty type here We also s...
متن کاملDelimited control operators prove Double-negation Shift
We propose an extension of minimal intuitionistic predicate logic, based on delimited control operators, that can derive the predicate-logic version of the Double-negation Shift schema, while preserving the disjunction and existence properties.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 75 شماره
صفحات -
تاریخ انتشار 2010